翻訳と辞書
Words near each other
・ Journey of a Gemini
・ Journey of a Princess
・ Journey of a Red Fridge
・ Journey of Apollo 15 to the Moon
・ Journey of Dreams
・ Journey of Hope (film)
・ Journey of Hope Botswana
・ Journey of Life
・ Journey of Reconciliation
・ Journey of self-discovery
・ Journey of Souls
・ Journey of Souls (album)
・ Journey of the Dunadan
・ Journey of the Magi
・ Journey Out of Darkness
Journey planner
・ Journey Prize
・ Journey South
・ Journey South (album)
・ Journey Through a Body
・ Journey Through a Small Planet
・ Journey Through Dalmatia
・ Journey Through Europe
・ Journey Through Hallowed Ground National Heritage Area
・ Journey Through Rosebud
・ Journey Through the Decade
・ Journey Through the Impossible
・ Journey Through the Night
・ Journey Through the Past
・ Journey Through the Past (film)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Journey planner : ウィキペディア英語版
Journey planner

A journey planner (or trip planner) is a specialised electronic search engine used to find the best journey between two points by some means of transport. Journey planners have been widely used in the travel industry since the 1970s by booking agents accessed through a user interface on a computer terminal, and to support call centre agents providing public transport information. With the advent of the internet, self-service browser based on-line journey planner interfaces for use by the general public have become widely available. A journey planner may be used in conjunction with ticketing and reservation systems, or just to provide schedule information.
== Scope ==
A journey planner finds one or more suggested journeys between an origin and a destination.
Searches may be optimised on different criteria, for example ''fastest'', ''shortest'', ''least changes'', ''cheapest''. They may be constrained for example to leave or arrive at a certain time, to avoid certain waypoints, etc.
The origin and destination may be specified as geospatial coordinates, named topographical places (e.g. 'Timperley', 'Scunthorpe', 'Grimsby' ), Points of Interest e.g. 'British Museum', or names or identifiers of points of access to public transport such as bus stops, stations, airports or ferry ports. A location finding process will typically first resolve the origin and destination into the nearest known nodes on the transport network in order to compute a journey plan over its data set of known journeys.
Journey planners for large networks typically use a search algorithm to search a graph of nodes (representing access points to the transport network) and edges (representing possible journeys between points). Different weightings such as distance, cost or accessibility may be associated with each edge.
Historically a Route planner has covered just the Route, showing a path by which it is possible to travel between two points at any time; in contrast a Journey Planner has also take into account the timetable of services that run over the network only at certain times, and so the time of travel is relevant when computing a journey. However with the development of "road timetables", associating different journey times for road links at different times of day, time of travel is also relevant for road route planners.
Also known as a "Trip Planner", a Journey Planner may cover a single mode of transport, e.g. rail, or many transport modes for a combined journey, e.g. bus rail, air, in which case it is an Intermodal Journey Planner.
A Road Route Planner is a journey planner specialised for road network use. Road networks are characterised by a large number of nodes and edges which may typically be used at any time.
A Public Transport Journey Planner (or in American English usage, a Public Transport Route planner) is specialised for journeys on Public Transport. A public transport network is characterised by a smaller graph, with services that typically run only at a particular time or at a specified frequency.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Journey planner」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.